The Split and Strong Split Interiordomination of a Graph
نویسندگان
چکیده
A subset D of the vertex set V(G) a graph G is said to be dominating if every not in adjacent at least one V-D. an interior v ∈D, G. The minimum cardinalities interiordominating sets called interiordomination number γId (G) G.An splitinteriordominating induced subgraph disconnected An strong split totally with two vertices. In this paper, we determine and γsId γssid for some standard graphs obtain bounds general graphs.
منابع مشابه
The edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملthe edge tenacity of a split graph
the edge tenacity te(g) of a graph g is de ned as:te(g) = min {[|x|+τ(g-x)]/[ω(g-x)-1]|x ⊆ e(g) and ω(g-x) > 1} where the minimum is taken over every edge-cutset x that separates g into ω(g - x) components, and by τ(g - x) we denote the order of a largest component of g. the objective of this paper is to determine this quantity for split graphs. let g = (z; i; e) be a noncomplete connected spli...
متن کاملgroups for which the noncommuting graph is a split graph
the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...
متن کاملStrong non split r-domination number of a graph
In this paper, we define the notions of inverse strong non-split r-dominating set and inverse strong non-split r-domination number γ′snsr(G) of a graph G. We characterize graphs for which γsnsr(G) + γ′snsr(G) = n, where γsnsr(G) is the strong non-split r-domination number of G. We get many bounds on γ′snsr(G). Nordhaus-Gaddum type results are also obtained for this new parameter.
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics
سال: 2021
ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']
DOI: https://doi.org/10.1088/1742-6596/1947/1/012031